搜索资源列表
knapsack
- 遗传算法解决背包问题，matlab 代码-Genetic algorithm to solve knapsack problem
GA-knapsack-problem
- 使用遗传算法解决经典的背包问题，即整数规划问题。-Using genetic algorithm to solve the classic knapsack problem, that is, the problem of integer programming.
GA
- vc++中用以测试mpi并行的遗传算法，应用在0-1背包的问题中。-Vc++ is used to test the mpi parallel genetic algorithm (ga), used in 0-1 knapsack problem.
GA
- python遗传算法求解背包问题,后者由1978年由Merkel和Hellman提出。其运行依赖DEAP -python genetic algorithm knapsack problem, which in 1978 proposed by Merkel and Hellman. Its operation depend DEAP
GA0-1
- 0-1背包问题遗传算法，包含精英选择和非精英选择-0-1 knapsack problem algorithms, comprising elite and non-elite choose
bp
- 背包问题_遗传算法解决,matlab例程，数学建模常用算法-Genetic algorithm to solve knapsack problem _, matlab routines, mathematical modeling algorithms
bagcheng
- 利用遗传算法二值化编码方法解决背包问题。遗传算法（Genetic Algorithm）是模拟达尔文生物进化论的自然选择和遗传学机理的生物进化过程的计算模型，是一种通过模拟自然进化过程搜索最优解的方法。-Genetic Algorithm
GA
- matlab代码遗传算法解决背包问题，0-1整数规划问题-Genetic algorithm to solve knapsack problem, 01 integer programming problem
GA_solveKnapsack-problem
- 利用基本遗传算法解决组合优化问题——背包问题-solving Knapsack problem based on GA
GA0-1beibao
- Matlab 代码，用遗传算法解决01背包问题-Matlab code, using genetic algorithms to solve knapsack problem 01
genetic-algotithm
- 遗传算法解决0-1背包问题，并有其他非遗传算法解决该问题，两种方法功能的对比-Genetic algorithm solve the 0-1 knapsack problem and other approaths to solve the same problem.The comparation of the two methods.
Kp_IGAX
- 此程序采用了免疫遗传算法求解背包问题，其中重要参数都有说明。-Immune genetic algorithm has been developed to handle the knapsack problem, the important parameters have been described in the program
beibao
- 背包问题用遗传算法解决的一个例子-An example of using genetic algorithms to solve knapsack problem of
kp_ga
- 遗传算法求解背包问题,基本的遗传算法，采用顺序编码-Genetic algorithm for solving knapsack problem，the basic genetic algorithm, using the coding sequence
TSP
- 1.用模拟退火解决TSP问题 2.用遗传算法解决0/1背包问题-1. solve TSP problem using simulated annealing 2. 0/1 knapsack problem solved using genetic algorithms
ym_C.GA_for_Knapsack_Problem_hicode
- 遗传算法用于求解多目标背包问题，学包括基本的选择、杂交、变异等遗传算子.-Genetic algorithm for solving multi-objective knapsack problem, learning the basic choice, hybridization, mutation and other genetic operators.
TSP
- 遗传算法在旅行商问题下的一种应用代码，一种能够解决多维背包问题的应用代码。-Genetic algorithm in the traveling salesman problem of a kind of application code, one can solve the multi-dimensional knapsack problem application code.
liangziyichuan
- 量子遗传算法解决0-1背包问题的MATLAB代码，亲测好用-Quantum genetic algorithm to solve 0-1 knapsack problem MATLAB code, useful pro-test
OwnTest
- 通过Java编码实现标准遗传算法（SGA）解决背包问题(Through Java coding, the standard genetic algorithm (SGA) is implemented to solve knapsack problem)
knapsack_GA
- visual c++背包问题遗传算法求解，含注释(visual C++ knapsack problem genetic algorithm solution, containing annotation)